$\mathrm{wtt}$-complete sets are not necessarily $\mathrm{tt}$-complete
نویسندگان
چکیده
منابع مشابه
"Natural Language Texts are not necessarily Grammatical and Unambiguous or even Complete."
The EPISTLE system is being developed in a research project for exploring the feasibility of a variety of intelligent applications for the processing of business and office text (!'Z; the authors of are the project workers). Although ultimately intended functions include text generation (e.g., 4), present efforts focus on text analysis: developing the capability to take in essentially unconstra...
متن کاملInflationary spacetimes are not past - complete
Arvind Borde, 2 Alan H. Guth, 3 and Alexander Vilenkin Institute of Cosmology, Department of Physics and Astronomy Tufts University, Medford, MA 02155, USA. Natural Sciences Division, Southampton College, NY 11968, USA. Center for Theoretical Physics, Laboratory for Nuclear Science and Department of Physics, Massachusetts Institute of Technology, Cambridge, MA 02139, USA. (Dated: January 11, 2003)
متن کاملAlmost Complete Sets
We show that there is a set which is almost complete but not complete under polynomial-time many-one (p-m) reductions for the class E of sets computable in deterministic time 2. Here a set A in a complexity class C is almost complete for C under some reducibility r if the class of the problems in C which do not r-reduce to A has measure 0 in C in the sense of Lutz’s resource-bounded measure the...
متن کاملSplitting NP-Complete Sets
We show that a set is m-autoreducible if and only if it is m-mitotic. This solves a long standing open question in a surprising way. As a consequence of this unconditional result and recent work by Glaßer et al., complete sets for all of the following complexity classes are m-mitotic: NP, coNP, ⊕P, PSPACE, and NEXP, as well as all levels of PH, MODPH, and the Boolean hierarchy over NP. In the c...
متن کاملRedundancy in Complete Sets
We show that a set is m-autoreducible if and only if it is m-mitotic. This solves a long standing open question in a surprising way. As a consequence of this unconditional result and recent work by Glaßer et al. [11], complete sets for all of the following complexity classes are m-mitotic: NP, coNP, ⊕P, PSPACE, and NEXP, as well as all levels of PH, MODPH, and the Boolean hierarchy over NP. In ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1975
ISSN: 0002-9939
DOI: 10.1090/s0002-9939-1975-0357087-x